Labels:text | screenshot | display | software | multimedia software OCR: SCENE-ERY III CEBIT PAGE 136 CODER CORNER I want to make a Coder Corner here at this place in the upcomming issues, realization 50 please, all you coders out there, Quicksort-Algorithm. of the please send a little article or an older documented source with The priciples of the algorithm : explaining the realization and e.g. This is a possibility of sorting the Mathematical backgrounds etc. Those articles could be helpful for numbers , The Bubble Sort is of course a little easier to code, but coders who still haven't coded a in sorting big masses of numbers, special kind of routine and other examples for it's very slow, not so the Quicksort, coders could _send optimizing the published routines , It is based on the 'Divide And Conquer' strategy. One big pile Perhaps you could look at the (here an array) of numbers is divided into G smaller ones, Jou grab one following program written in Pascal It's a kind of routine which is not number out of those (Partition- or Pivo-Element) and so often used Demos or Intros, but compare all other numbers with it, All numbers which surely in many Utilities, It's the are smaller belong to the one side Coder Corner PAGE 001 / 004 PAGE PAGE MENU + ARTICLE ARTICLE > TEHT
(VLSI)_005.png){kind=small}
(VLSI)_005_thumb.jpg){kind=link}